Interval competition graphs of symmetric diagraphs
نویسندگان
چکیده
منابع مشابه
Interval competition graphs of symmetric diagraphs
In this paper we answer the following question: given a loopless symmetric digraph D with underlying interval graph H. what conditions are necessary and sufficient for the competition graph of D to be interval or unit interval‘? This question, first posed by Raychaudhuri and Roberts [lo]. was left open in our previous paper 171. In that paper we presented the background of this question in the ...
متن کاملInterval-valued neutrosophic competition graphs
We first introduce the concept of interval-valued neutrosophic competition graphs. We then discuss certain types, including kcompetition interval-valued neutrosophic graphs, p-competition intervalvalued neutrosophic graphs and m-step interval-valued neutrosophic competition graphs. Moreover, we present the concept of m-step intervalvalued neutrosophic neighbourhood graphs. 2010 AMS Classificati...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملA class of acyclic digraphs with interval competition graphs
Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. In this paper, we show that the competition graphs of doubly partial orders are interval graphs. We also show that an interval graph together with enough isolated vertices is the competit...
متن کاملThe p-Competition Graphs of Symmetric Digraphs and p-Neighborhood Graphs
The p-competition graph G of a digraph D is a graph on the same vertex set as D, with x; y] 2 E(G) if and only if jOut(x) \Out(y)j p in D. In this paper we focus on the case in which D is a symmetric digraph ((a; b) is an arc in D if and only if (b; a) is an arc in D). We relate the problem to 2-step graphs, squares, and a generalization of the neighborhood graph called the p-neighborhood graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90121-9